On the expected maximum degree of Gabriel and Yao graphs
نویسندگان
چکیده
منابع مشابه
On the Expected Maximum Degree of Gabriel and Yao Graphs
Motivated by applications of Gabriel graphs andYao graphs in wireless ad-hoc networks, we show that the maximum degree of a random Gabriel graph or Yao graph defined on n points drawn uniformly at random from a unit square grows as (log n/ log log n) in probability.
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملLow Degree Algorithms for Computing and Checking Gabriel Graphs
In the context of robust computational geometry we focus on the problem of computing and checking Gabriel graphs with algorithms that are not aaected by degenaracies and have low arithmetic demand. A simple and practical linear-time algorithm is presented that constructs the Gabriel Graph of a nite point set on the plane from its Delaunay diagram. The degree of the algorithm, i.e. a measure of ...
متن کاملon translation of phatic communion and socio-cultural relationships between the characters of the novels
phatic communion is a cultural concept which differs across cultures. according to hofstede (2001), the u.s. tends to have individualistic culture; however, asian countries tend to have collectivistic cultures. these cultures view phatic communion differently. in individualistic cultures like u.s., phatic communion reflects speakers’ socio-cultural relationships in conversations. to see whether...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Probability
سال: 2009
ISSN: 0001-8678,1475-6064
DOI: 10.1239/aap/1261669589